A Self-stabilizing Weighted Matching Algorithm
نویسندگان
چکیده
The problem of computing a matching in a graph involves creating pairs of neighboring nodes such that no node is paired more than once. Previous work on the matching problem has resulted in several selfstabilizing algorithms for finding a maximal matching in an unweighted graph. In this paper we present the first self-stabilizing algorithm for the weighted matching problem. We show that the algorithm computes a 2 -approximation to the optimal solution. The algorithm is simple and uses only a fixed number of variables per node. Stabilization is shown under various types of daemons.
منابع مشابه
A Self-stabilizing Algorithm for Maximum Popular Matching of Strictly Ordered Preference Lists
In this paper, we consider the problem of Popular Matching of strictly ordered preference lists. A Popular Matching is not guaranteed to exist in any network. We propose an IDbased, constant space, self-stabilizing algorithm that converges to a Maximum Popular Matching—an optimum solution, if one exist. We show that the algorithm stabilizes in moves under any scheduler (daemon). Keywords—self-s...
متن کاملA Self-Stabilizing Algorithm for Maximum Matching in Trees
Constructing a maximum matching is an important problem in graph theory with applications to problems such as job assignment and task scheduling. Many eecient sequential and parallel algorithms exist for solving the problem. However, no distributed algorithms are known. In this paper, we present a distributed, self-stabilizing algorithm for nding a maximum matching in trees. Since our algorithm...
متن کاملAn Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees
We present an anonymous self-stabilizing algorithm for finding a 1-maximal matching in trees, and rings of length not divisible by 3. We show that the algorithm converges in O(n) moves under an arbitrary central daemon.
متن کاملThe Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm
The idea of self-stabilization was introduced by Edsger W. Dijkstra in 1974 [1]. Self-stabilizing algorithms enable systems to be started in an arbitrary state and still converge to a desired behavior. In this letter, we discuss the time complexity of the self-stabilizing algorithm proposed by Hsu and Huang in [2], which finds a maximal matching in a network. This algorithm is the first self-st...
متن کاملSelf-stabilizing Neighborhood Unique Naming under Unfair Scheduler
We propose a self-stabilizing probabilistic solution for the neighborhood unique naming problem in uniform, anonymous networks with arbitrary topology. This problem is important in the graph theory Our solution stabilizes under the unfair distributed scheduler. We prove that this solution needs in average only one trial per processor. We use our algorithm to transform the [6] maximal matching a...
متن کامل